Polylogarithmic Gap between Meshes with Reconfigurable Row/Column Buses and Meshes with Statically Partitioned Buses
نویسنده
چکیده
This paper studies the difference in computational power between the mesh-connected parallel computers equipped with dynamically reconfigurable bus systems and those with static ones. The mesh with separable buses (MSB) is the meshconnected parallel computer with dynamically reconfigurable row/column buses. The broadcast buses of the MSB can be dynamically sectioned into smaller bus segments by program control. We show that the MSB of size can work with ( ) step even if its dynamic reconfigurable function is disabled. Here, we assume the word-model broadcast buses, and use the relation between the word-model bus and the bit-model bus. Keywordsmesh-connected parallel computer; dynamically reconfigurable bus; statically partitioned bus; simulation algorithm.
منابع مشابه
Simulation of Meshes with Separable Buses by Meshes with Multiple Partitioned Buses
This paper studies the simulation problem of meshes with separable buses (MSB) by meshes with multiple partitioned buses (MMPB). The MSB and the MMPB are the mesh connected computers enhanced by the addition of broadcasting buses along every row and column. The broadcasting buses of the MSB, called separable buses, can be dynamically sectioned into smaller bus segments by program control, while...
متن کاملAn Efficient Scaling-Simulation Algorithm of Reconfigurable Meshes by Meshes with Partitioned Buses
This paper presents an efficient scaling-simulation algorithm that simulates operations of the reconfigurable mesh (RM) of size n× n using the mesh with partitioned buses (MPB) of size m×m (m < n). The RM and the MPB are the two-dimensional mesh-connected computers equipped with broadcasting buses. The broadcasting buses of the RM can be used to dynamically obtain various interconnection patter...
متن کاملEffective Partitioning of Static Global Buses for Small Processor Arrays
This paper shows an effective partitioning of static global row/column buses for tightly coupled 2D mesh-connected small processor arrays (“mesh”, for short). With additional O(n/m (n/m + log m)) time slowdown, it enables the mesh of size m×m with static row/column buses to simulate the mesh of the larger size n×n with reconfigurable row/column buses (m ≤ n). This means that if a problem can be...
متن کاملRouting with locality in partitioned-bus meshes
We show that adding partitioned-buses (as opposed to long buses that span an entire row or column) to ordinary meshes can reduce the routing tame b y approximately one-third f o r permutation routing with locality. A matching time lower bound i s also proved. The result can be generalized to multi-packet routing.
متن کاملRouting with Locality on Meshes with Buses
a d 1 O(d/f(d)) step, O( f(d)) buffer size routing algorithm which is asymptotically optimal if f(d) is chosen to be a large constant. In our study, we assume all the processors operate in synchronous MIMD mode. At any time step, each processor can communicate with all of its grid neighbors and can both send and receive one packet along each mesh link. In addition, processors can also store pac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1312.2807 شماره
صفحات -
تاریخ انتشار 2012